Exploiting special structure in Karmarkar's linear programming algorithm
نویسندگان
چکیده
منابع مشابه
Exploiting special structure in semidefinite programming: A survey of theory and applications
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven much more difficult to exploit structure in the SDP data during computation. We survey three types of special structures in SDP data: 1. a common ‘chordal’ sparsity pattern of all the data matrices. This structure ari...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملOn Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
During the last decade interior-point methods have become an eecient alternative to the simplex algorithm for solution of large-scale linear programming (LP) problems. However, in many practical applications of LP, interior-point methods have the drawback that they do not generate an optimal basic and nonbasic partition of the variables. This partition is required in the traditional sensitivity...
متن کاملTowards Exploiting Duality in Approximate Linear Programming for MDPs
A weakness of classical methods for solving Markov decision processes is that they scale very poorly because of the flat state space, which subjects them to the curse of dimensionality. Fortunately, many MDPs are well-structured, which makes it possible to avoid enumerating the state space. To this end, factored MDP representations have been proposed (Boutilier, Dearden, & Goldszmidt 1995; Koll...
متن کاملAn Exponential Approximation Algorithm in Linear Programming
The algorithm determines a non-iteration procedure for computing the optimal solution of a linear programming problem. We consider approximating system of linear equations to determine the optimal basis variables of the linear programming problem. The usefulness of the algorithm is illustrated by a numerical example. © 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1988
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01580755